Hierarchical addressing in symbolic computation
نویسندگان
چکیده
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملHIERARCHICAL COMPUTATION OF HERMITE SPHERICAL INTERPOLANT
In this paper, we propose to extend the hierarchical bivariateHermite Interpolant to the spherical case. Let $T$ be an arbitraryspherical triangle of the unit sphere $S$ and let $u$ be a functiondefined over the triangle $T$. For $kin mathbb{N}$, we consider aHermite spherical Interpolant problem $H_k$ defined by some datascheme $mathcal{D}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کاملhierarchical computation of hermite spherical interpolant
in this paper, we propose to extend the hierarchical bivariatehermite interpolant to the spherical case. let $t$ be an arbitraryspherical triangle of the unit sphere $s$ and let $u$ be a functiondefined over the triangle $t$. for $kin mathbb{n}$, we consider ahermite spherical interpolant problem $h_k$ defined by some datascheme $mathcal{d}_k(u)$ and which admits a unique solution $p_k$in the ...
متن کاملSupporting Creativity in Symbolic Computation
For many people, creativity and computers are contradictory concepts: how can novel concepts arise in a machine which is designed to only do what it is programmed to do? In this paper, I give a computational model of at least one form of creativity and describe how the processes underlying it can be implemented in symbolic computation. Finally, I discuss the lessons that can be learned from the...
متن کاملMerging Sub-symbolic and Symbolic Computation
In a recent short paper and a report (see [Neto et al. 98] and [Neto and Costa 99]) it was shown that programming languages can be translated efficiently on recurrent (analog, rational weighted) neural nets, using bounded resources. This fact was achieved by creating a neural programming language called NETDEF, such that each program corresponds to a modular neural net that computes it. This fr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 1994
ISSN: 0898-1221
DOI: 10.1016/0898-1221(94)00167-7